Accelerate Convergence of Polarized Random Fourier Feature-Based Kernel Adaptive Filtering With Variable Forgetting Factor and Step Size

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Variable step size adaptive decorrelation filtering for competing speech separation

Two variable step size (VSS) techniques are proposed for adaptive decorrelation filtering (ADF) to improve the performance of competing speech separation. The first VSS method applies gradient adaptive step-size (GAS) to increase ADF convergence rate. Under some simplifying assumptions, the GAS technique is generalized to allow the combination with additional VSS techniques for ADF algorithm. T...

متن کامل

The Wavelet Transform-Domain LMS Adaptive Filter Algorithm with Variable Step-Size

The wavelet transform-domain least-mean square (WTDLMS) algorithm uses the self-orthogonalizing technique to improve the convergence performance of LMS. In WTDLMS algorithm, the trade-off between the steady-state error and the convergence rate is obtained by the fixed step-size. In this paper, the WTDLMS adaptive algorithm with variable step-size (VSS) is established. The step-size in each subf...

متن کامل

Improved Variable Step-Size and Variable Parameters LMS Adaptive Filtering Algorithm

In order to achieve the best filtering performance and make the filter automatically adjust its coefficients with the changing of its working environment, we need to use adaptive filter technique. To overcome the contradiction of traditional LMS algorithm between convergence speed, convergence accuracy and the selection of step-size, a novel variable step-size & variable parameters adaptive fil...

متن کامل

Analysis of LMS-Newton adaptive filtering algorithms with variable convergence factor

An analysis of two LMS-Newton adaptive filtering algorithms with variable convergence factor is presented. The relations of these algorithms with the conventional recursive least-squares algorithm are first addressed. Their performance in stationary and nonstationary environments is then studied and closed-form formulas for the excess mean-square error (MSE) are derived. The paper deals, in add...

متن کامل

Gradient based variable forgetting factor RLS algorithm

The recursive least squares (RLS) algorithm is well known for its good convergence property and small mean square error in stationary environments. However RLS using constant forgetting factor cannot provide satisfactory performance in time varying environments. In this seminar, three variable forgetting factor (VFF) adaptation schemes for RLS are presented in order to improve the tracking perf...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2020

ISSN: 2169-3536

DOI: 10.1109/access.2020.2975536